Worst-case Optimal Join Algorithms
نویسندگان
چکیده
منابع مشابه
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems
Worst-case optimal join algorithms are the class of join algorithms whose runtime match the worst-case output size of a given join query. While the first provably worse-case optimal join algorithm was discovered relatively recently, the techniques and results surrounding these algorithms grow out of decades of research from a wide range of areas, intimately connecting graph theory, algorithms, ...
متن کاملWorst-Case Optimal Join at a Time
Joins are at the core of database systems, yet worst-case optimal join algorithms have been developed only recently. At the outset of this effort is the observation that the standard join plans are suboptimal as their intermediate results may be larger than the final result. To attain worst-case optimality, new join algorithms are monolithic and thus avoid intermediate results. The conceptual c...
متن کاملLeapfrog Triejoin: a worst-case optimal join algorithm
Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full conjunctive query, given constraints on the input relation sizes. In 2012, Ngo, Porat, R«e and Rudra (henceforth NPRR) devised a join algorithm with worst-case running time proportional to the AGM bound [8]. Our commercial ...
متن کاملTriejoin: A Simple, Worst-Case Optimal Join Algorithm
Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full conjunctive query, given constraints on the input relation sizes. In 2012, Ngo, Porat, Ré and Rudra (henceforth NPRR) devised a join algorithm with worst-case running time proportional to the AGM bound [8]. Our commercial d...
متن کاملLeapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm
Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full conjunctive query, given constraints on the input relation sizes. In 2012, Ngo, Porat, Ré and Rudra (henceforth NPRR) devised a join algorithm with worst-case running time proportional to the AGM bound [8]. Our commercial D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2018
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3180143